/*
 * Copyright (c) 2012 Johan Fylling
 * 
 * Permission is hereby granted, free of charge, to any person obtaining a copy 
 * of this software and associated documentation files (the "Software"), to deal
 * in the Software without restriction, including without limitation the rights 
 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell 
 * copies of the Software, and to permit persons to whom the Software is 
 * furnished to do so, subject to the following conditions:
 * 
 * The above copyright notice and this permission notice shall be included in 
 * all copies or substantial portions of the Software.
 * 
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR 
 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, 
 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE 
 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER 
 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, 
 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN 
 * THE SOFTWARE.
 */

part of math;


class Interval {
  num min;
  num max;
  
  Interval ([this.min=0, this.max=0]);
  
  bool isValid () => this.min <= this.max;
  
  /**
   * @return true if the intervals overlap, false othervise.
   */
  bool overlap (Interval other) {
    if (!isValid() || !other.isValid()) {
      return false;
    }
    return !(this.min > other.max || other.min > this.max);
  }
  
  num getOverlap (Interval other) {
    if (overlap(other)) {
      return Math.min(this.max, other.max) - Math.max(this.min, other.min);
    }
    return 0;
  }
  
  /**
   * @return true if this interval contains the other completely.
   */
  bool contains (Interval other) {
    if (!isValid() || !other.isValid()) {
      return false;
    }
    return this.min < other.min && this.max > other.max;
  }
}
